On bilevel minimum and bottleneck spanning tree problems
نویسندگان
چکیده
منابع مشابه
Reload cost problems: minimum diameter spanning tree
We examine a network design problem under the reload cost model. Given an undirected edge colored graph, reload costs on a path arise at a node where the path uses consecutive edges of di(erent colors. We consider the problem of 0nding a spanning tree of minimum diameter with respect to the reload costs. We present lower bounds for the approximability even on graphs with maximum degree 5. On th...
متن کاملOn the Shortest Path and the Minimum Spanning Tree Problems
2005A7TS183P, in partial fulfillment of the requirements for BITS C421T Thesis, embodies the work done by him under my supervision. Acknowledgements I am extremely grateful to my supervisor, Kiran D.C. for his unstinting help throughout the course of my thesis work. I especially wish to thank him for allowing me to work with a great deal of freedom, and for guiding and supporting me in my other...
متن کاملalgorithms for parametric minimum spanning tree problems on planar graphs ’
A linear-time algorithm for the minimum-ratio spanning tree problem on planar graphs is presented. The algorithm is based on a new planar minimum spanning tree algorithm. The approach extends to other parametric minimum spanning tree problems on planar graphs and to other families of graphs having small separators.
متن کاملMinimum Cost Spanning Tree Problems with Restrictions on Coalitions
We focus on minimum cost spanning tree problems (mcstps) where agents need to be connected with a source directly or indirectly through other agents with the minimum cost. Mcstps have been studied as cooperative games, where all of agents cooperate to construct a minimum cost spanning tree (mcst), and share the cost of the mcst. There actually exist situations where some coalitions of agents ar...
متن کاملVariable neighborhood search for the cost constrained minimum label spanning tree and label constrained minimum spanning tree problems
Given an undirected graph whose edges are labeled or colored, edge weights indicating the cost of an edge, and a positive budget B, the goal of the cost constrained minimum label spanning tree (CCMLST) problem is to find a spanning tree that uses the minimum number of labels while ensuring its cost does not exceed B. The label constrained minimum spanning tree (LCMST) problem is closely related...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Networks
سال: 2019
ISSN: 0028-3045,1097-0037
DOI: 10.1002/net.21881